Testing connectivity of faulty networks in sublinear time
نویسندگان
چکیده
منابع مشابه
Testing connectivity of faulty networks in sublinear time
Given a set F of vertices of a connected graph G, we study the problem of testing the connectivity of G−F in polynomial time with respect to |F | and the maximum degree ∆ of G. We present two approaches. The first algorithm for this problem runs in O ( |F |∆2ε−1 log(|F |∆ε−1) ) time for every graph G with vertex expansion at least ε > 0. The other solution, designed for the class of graphs with...
متن کاملOptimal Time Broadcasting in Faulty Star Networks
This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...
متن کاملMinimum time broadcast in faulty star networks
In this paper we give new results on the fault{tolerance capabilities of the star graph. We rst consider the problem of determining the maximum number r(n) of vertices in a n! vertices star graph S n such that by removing any set of vertices and/or edges from S n of cardinality at most r(n) the diameter of S n does not increase. Subsequently, we give an algorithm for broadcasting a message in S...
متن کاملTesting Acyclicity of Directed Graphs in Sublinear Time
This paper initiates the study of testing properties of directed graphs. In particular, the paper considers the most basic property of directed graphs – acyclicity. Because the choice of representation affects the choice of algorithm, the two main representations of graphs are studied. For the adjacency matrix representation, most appropriate for dense graphs, a testing algorithm is developed t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.12.014